A note on 2--bisections of claw--free cubic graphs

A \emph{$k$--bisection} of a bridgeless cubic graph $G$ is a $2$--colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes have order at most $k$. Ban and Linial conjectured that {\em every bridgeless cubic graph admits a $2$--bisection except for the Petersen graph}. In this note, we prove Ban--Linial's conjecture for claw--free cubic graphs

The Generation of Fullerenes

We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator for fullerenes -- fullgen -- and the first program since fullgen to be useful for more than 100 vertices. We also note a programming error in fullgen that caused problems for 136 or more vertices. We tabulate the numbers of fullerenes and IPR fullerenes up to 400 vertices. We also check up to 316 vertices a conjecture of Barnette that cubic planar graphs with maximum face size 6 are hamiltonian and verify that the smallest counterexample to the spiral conjecture has 380 vertices.Comment: 21 pages; added a not

kk-Critical Graphs in P5P_5-Free Graphs

Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. Let $P_t$ be the path on $t$ vertices. A graph $G$ is $k$-vertex-critical if $G$ has chromatic number $k$ but every proper induced subgraph of $G$ has chromatic number less than $k$. The study of $k$-vertex-critical graphs for graph classes is an important topic in algorithmic graph theory because if the number of such graphs that are in a given hereditary graph class is finite, then there is a polynomial-time algorithm to decide if a graph in the class is $(k-1)$-colorable. In this paper, we initiate a systematic study of the finiteness of $k$-vertex-critical graphs in subclasses of $P_5$-free graphs. Our main result is a complete classification of the finiteness of $k$-vertex-critical graphs in the class of $(P_5,H)$-free graphs for all graphs $H$ on 4 vertices. To obtain the complete dichotomy, we prove the finiteness for four new graphs $H$ using various techniques -- such as Ramsey-type arguments and the dual of Dilworth's Theorem -- that may be of independent interest.Comment: 18 page

Evaluation of Directed Graph-Mapping in Complex Atrial Tachycardias

Objectives: Directed graph-mapping (DGM) is a novel operator-independent automatic tool that can be applied to the identification of the atrial tachycardia (AT) mechanism. In the present study, for the first time, DGM was applied in complex AT cases, and diagnostic accuracy was evaluated. Background: Catheter ablation of ATs still represents a challenge, as the identification of the correct mechanism can be difficult. New algorithms for high-density activation mapping (HDAM) render an easier acquisition of more detailed maps; however, understanding of the mechanism and, thus, identification of the ablation targets, especially in complex cases, remains strongly operator-dependent. Methods: HDAMs acquired with the latest algorithm (COHERENT version 7, Biosense Webster, Irvine, California) were interpreted offline by 4 expert electrophysiologists, and the acquired electrode recordings with corresponding local activation times (LATs) were analyzed by DGM (also offline). Entrainment maneuvers (EM) were performed to understand the correct mechanism, which was then confirmed by successful ablation (13 cases were centrifugal, 10 cases were localized re-entry, 22 cases were macro–re-entry, and 6 were double-loops). In total, 51 ATs were retrospectively analyzed. We compared the diagnoses made by DGM were compared with those of the experts and with additional EM results. Results: In total, 51 ATs were retrospectively analyzed. Experts diagnosed the correct AT mechanism and location in 33 cases versus DGM in 38 cases. Diagnostic accuracy varied according to different AT mechanisms. The 13 centrifugal activation patterns were always correctly identified by both methods; 2 of 10 localized reentries were identified by the experts, whereas DGM diagnosed 7 of 10. For the macro–re-entries, 12 of 22 were correctly identified using HDAM versus 13 of 22 for DGM. Finally, 6 of 6 double-loops were correctly identified by the experts, versus 5 of 6 for DGM. Conclusions: Even in complex cases, DGM provides an automatic, fast, and operator-independent tool to identify the AT mechanism and location and could be a valuable addition to current mapping technologies. © 2021 The Authors.Dr. Lorenzo is an employee of Biosense Webster. Dr. Goedgebeur is funded with a research grant of the Research Foundation Flanders/Fonds voor Wetenschappelijk Onderzoek (FWO). Dr. Strisciuglio is supported by a research grant from the Cardiopath PhD program. Dr. el Haddad is a consultant for Biosense Webster. Dr. Duytschaever is a consultant for Biosense Webster. All other authors have reported that they have no relationships relevant to the contents of this paper to disclose

Switching 3-edge-colorings of cubic graphs

The chromatic index of a cubic graph is either 3 or 4. Edge-Kempe switching, which can be used to transform edge-colorings, is here considered for 3-edge-colorings of cubic graphs. Computational results for edge-Kempe switching of cubic graphs up to order 30 and bipartite cubic graphs up to order 36 are tabulated. Families of cubic graphs of orders 4n + 2 and 4n + 4 with 2(n) edge-Kempe equivalence classes are presented; it is conjectured that there are no cubic graphs with more edge-Kempe equivalence classes. New families of nonplanar bipartite cubic graphs with exactly one edge-Kempe equivalence class are also obtained. Edge-Kempe switching is further connected to cycle switching of Steiner triple systems, for which an improvement of the established classification algorithm is presented. (C) 2022 Elsevier B.V. All rights reserved

Generation and properties of nut graphs

A nut graph is a graph on at least 2 vertices whose adjacency matrix has nullity 1 and for which non-trivial kernel vectors do not contain a zero. Chemical graphs are connected, with maximum degree at most three. We present a new algorithm for the exhaustive generation of non-isomorphic nut graphs. Using this algorithm, we determined all nut graphs up to 13 vertices and all chemical nut graphs up to 22 vertices. Furthermore, we determined all nut graphs among the cubic polyhedra up to 34 vertices and all nut fullerenes up to 250 vertices. Nut graphs are of interest in chemistry of conjugated systems, in models of electronic structure, radical reactivity and molecular conduction. The relevant mathematical properties of chemical nut graphs are the position of the zero eigenvalue in the graph spectrum, and the dispersion in magnitudes of kernel eigenvector entries (r: the ratio of maximum to minimum magnitude of entries). Statistics are gathered on these properties for all the nut graphs generated here. We also show that all chemical nut graphs have r = 2 and that there is at least one chemical nut graph with r ≥ 2 for every order n ≥ 9 (with the exception of n = 10)

k-Critical graphs in P5-free graphs

Given two graphs H1 and H2, a graph G is (H1, H2)-free if it contains no induced subgraph isomorphic to H1 or H2. Let Pt be the path on t vertices. A graph G is k-vertex-critical if G has chromatic number k but every proper induced subgraph of G has chromatic number less than k. The study of k-vertex-critical graphs for graph classes is an important topic in algorithmic graph theory because if the number of such graphs that are in a given hereditary graph class is finite, then there is a polynomial-time algorithm to decide if a graph in the class is (k−1)- colorable. In this paper, we initiate a systematic study of the finiteness of k-vertex-critical graphs in subclasses of P5-free graphs. Our main result is a complete classification of the finiteness of k-vertex-critical graphs in the class of (P5, H)-free graphs for all graphs H on 4 vertices. To obtain the complete dichotomy, we prove the finiteness for four new graphs H using various techniques – such as Ramsey-type arguments and the dual of Dilworth’s Theorem – that may be of independent interest